A Gentle Introduction to Linked Lists

نویسنده

  • Michael H. Goldwasser
چکیده

We consider a pedagogy for introducing linked lists in the context of a non-programming, breadth-first introductory course. In short, linked lists are presented based upon their direct embedding in an underlying memory configuration. Though this approach to teaching linked lists is not original, it is surprisingly rare in a breadth-first context. Yet it affords a rich exploration of many key aspects of linked data structures. Furthermore, the coverage can be spiraled with many common aspects of a breadth-first introduction, effectively integrating topics such as memory management, data representation and algorithmic analysis. Our treatment is coupled with newly developed software that allows students to fully investigate the depth of the subject via hands-on, non-programming experiences. Students can set and modify the contents of a displayed memory configuration, viewing the effect of those changes on a schematic diagram of the embedded linked list.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms

In this paper‎, ‎an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms‎. ‎We use different drop tolerance parameters to compute the preconditioners‎. ‎To study the effect of such a dropping on the quality of the ILU ...

متن کامل

A Gentle Introduction to Yao’s Garbled Circuits

This is a short, gentle introduction to the Yao’s Garbled Circuits construction and recent optimizations, as well as the garbled circuit definitions.

متن کامل

A Review of Nonnegative Matrix Factorization Methods for Clustering

Nonnegative Matrix Factorization (NMF) was first introduced as a low-rank matrix approximation technique, and has enjoyed a wide area of applications. Although NMF does not seem related to the clustering problem at first, it was shown that they are closely linked. In this report, we provide a gentle introduction to clustering and NMF before reviewing the theoretical relationship between them. W...

متن کامل

Slicing Planar Grid Diagrams: a Gentle Introduction to Bordered Heegaard Floer Homology

We describe some of the algebra underlying the decomposition of planar grid diagrams. This provides a useful toy model for an extension of Heegaard Floer homology to 3-manifolds with parametrized boundary. This paper is meant to serve as a gentle introduction to the subject, and does not itself have immediate topological applications.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015